TARDIS: Timestamp based Coherence Algorithm for Distributed Shared Memory
نویسندگان
چکیده
A new memory coherence protocol, Tardis, is proposed. Tardis uses timestamp counters representing logical time as well as physical time to order memory operations and enforce sequential consistency in any type of shared memory system. Tardis is unique in that as compared to the widely-adopted directory coherence protocol, and its variants, it completely avoids multicasting and only requires O(logN) storage per cache block for an N -core system rather than O(N) sharer information. Tardis is simpler and easier to reason about, yet achieves similar performance to directory protocols on a wide range of benchmarks run on 16, 64 and 256 cores. Keywords-coherence; timestamp; scalability; sequential consistency;
منابع مشابه
Tardis 2.0: An Optimized Time Traveling Coherence Protocol
Cache coherence scalability is a big challenge in shared memory systems. Traditional protocols do not scale due to the storage and traffic overhead of cache invalidation. Tardis, a recently proposed coherence protocol, removes cache invalidation using logical timestamps and achieves excellent scalability. The original Tardis protocol, however, only supports the Sequential Consistency (SC) memor...
متن کاملLibrary Cache Coherence
Directory-based cache coherence is a popular mechanism for chip multiprocessors and multicores. The directory protocol, however, requires multicast for invalidation messages and the collection of acknowledgement messages, which can be expensive in terms of latency and network traffic. Furthermore, the size of the directory increases with the number of cores. We present Library Cache Coherence (...
متن کاملA Distributed Shared Memory System with Self-Adjusting Coherence Scheme
The performance of distributed shared memory depends on the memory coherence algorithms and the access characteristics of shared data. In this paper, we propose an eecient coherence scheme using multiple coherence algorithms with self-adjusting feature. Our method can dynamically choose a more adaptive coherence algorithm for each variable class and the incorrect classiication of shared variabl...
متن کاملLarchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This DSM+PBR model is based on distributed garbage collection (GC). Within a general model for DSM+PBR, we specify a distributed GC algorithm that is efficient and scalable. Its main features are: (i) independent collection...
متن کاملEvaluating Cache Coherence in the DSMIO System
There has been a significant amount of research on object-based database management systems (ODBMS). In contrast to traditional relational systems, ODBMS use the same data model for the clients and the server. Thus, parallel ODBMS typically adopt a data-shipping architecture, which allows data request processing to be performed at the clients. Although such a strategy can improve performance by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1501.04504 شماره
صفحات -
تاریخ انتشار 2015